Computing Inferences for Credal ALC Terminologies
نویسندگان
چکیده
We describe a package that performs inferences for the probabilistic description logic crALC: given a terminology consisting of a set of sentences in crALC, and a set of assertions, the package computes the probability of additional assertions using an approximate variational method. We briefly review the essentials of crALC, mention some recent applications, and describe the package. We then describe our current efforts to incorporate lifted inference into the package.
منابع مشابه
Computing Inferences for Relational Bayesian Networks Based on ALC Constructs
Credal ALC combines the constructs of the well-known ALC logic with probabilistic assessments, so as to let terminologies convey uncertainty about concepts and roles. We present a restricted version of Credal ALC that can be viewed as a description language for a class of relational Bayesian networks. The resulting “crALC networks” offer a simplified and illuminating route both to Credal ALC an...
متن کاملComputing Maximally Satisfiable Terminologies for the Description Logic ALC with Cyclic Definitions
Existing description logic reasoners provide the means to detect logical errors in ontologies, but lack the capability to resolve them. We present a tableaubased algorithm for computing maximally satisfiable terminologies in ALC. Our main contribution is the ability of the algorithm to handle GCIs, using a refined blocking condition that ensures termination is achieved at the right point during...
متن کاملIDS: A Divide-and-Conquer Algorithm for Inference in Polytree-Shaped Credal Networks
A credal network is a graph-theoretic model that represents imprecision in joint probability distributions. An inference in a credal net aims at computing an interval for the probability of an interest event. The algorithms for inference in credal networks can be divided into exact and approximate. The selection of such an algorithm is based on a trade off that ponders how much time someone wan...
متن کاملSet-Based Variational Methods in Credal Networks: the SV2U Algorithm
Abstract. Graphical models that represent uncertainty through sets of probability measures are often referred to as credal networks. Polynomial-time exact inference methods are available only for polytree-structured binary credal networks. In this work, we approximate potentially intractable inferences in multiconnected binary networks by tractable inferences in polytree-structures. We propose ...
متن کاملLoopy Propagation in a Probabilistic Description Logic
This paper introduces a probabilistic description logic that adds probabilistic inclusions to the popular logic ALC, and derives inference algorithms for inference in the logic. The probabilistic logic, referred to as CRALC (“credal” ALC), combines the usual acyclicity condition with a Markov condition; in this context, inference is equated with calculation of (bounds on) posterior probability ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012